//
// Created by Jisam on 08/09/2024 7:17 PM.
// Solution of  你好，这里是牛客竞赛
//#pragma GCC optimize(3)
#include <bits/stdc++.h>

using namespace std;
#define endl "\n"
#define PSI pair<string,int>
#define PII pair<int,int>
#define PDI pair<double,int>
#define PDD pair<double,double>
#define VVI vector<vector<int>>
#define VI vector<int>
#define VS vector<string>
#define PQLI priority_queue<int, vector<int>, less<int>>
#define PQGI priority_queue<int, vector<int>, greater<int>>
#define code_by_jisam ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr)
typedef long long i64;
typedef unsigned u32;
typedef unsigned long long u64;
typedef __int128 i128;
int dx[] = {-1, 1, 0, 0, 1, 1, -1, -1,};
int dy[] = {0, 0, -1, 1, 1, -1, -1, 1,};


void solution() {
    string t;
    cin >> t;
    map<string,string> mp;
    mp["https://ac.nowcoder.com"] = "Ac";
    mp["https://www.nowcoder.com"] = "Nowcoder";
    mp["www.nowcoder.com"] = "Nowcoder";
    mp["ac.nowcoder.com"] = "Ac";

    string s = "";
    for (int i = 0; i < t.size(); i++) {
        s += t[i];
        if (i >= 2 && t[i] == 'm' && t[i - 1] == 'o' && t[i - 2] == 'c') {
            break;
        }
    }
    // std::cout << s << '\n';
    if (mp.count(s)) {
        std::cout << mp[s] << '\n';
    }
    else {
        std::cout << "No" << '\n';
    }
}

int main() {
    code_by_jisam;
    int T = 1;
    cin >> T;
    while (T--) {
        solution();
    }
    return 0;
}